Computation of Elliptic Fekete Point Sets
نویسندگان
چکیده
The objective of this work is to provide a methodology for approximating globally optimal Fekete point con-gurations. This problem is of obvious interest in numerical mathematics and scientic modeling. Following a brief discussion of the pertinent analytical background, Lipschitz global optimization (LGO) is applied to determine {i.e., to numerically approximate{ Fekete point congurations. Next to the optimization approach, an alternative strategy by f o rmulating a set of dierential-algebraic equations (DAEs) of index 2 will be considered. The steady states of the DAEs coincide with the optima of the function to be minimized. Illustrative numerical results {with congurations of up to 150 Fekete points{ are presented, to show the viability of both approaches. Note: Work partially carried out under the projects`Circuit simulation' (no. MAS2.2) and`Modelling of processes in Chemistry' (no. MAS2.6).
منابع مشابه
Localized Spot Patterns on the Sphere for Reaction-Diffusion Systems: Theory and Open Problems
A new class of point-interaction problem characterizing the time evolution of spatially localized spots for reaction-diffusion (RD) systems on the surface of the sphere is introduced and studied. This problem consists of a differential algebraic system (DAE) of ODE’s for the locations of a collection of spots on the sphere, and is derived from an asymptotic analysis in the large diffusivity rat...
متن کاملVirtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globally optimal Fekete point configurations. We found a highly interactive virtual environment, combined with a time-critical computation, can provide valuable insight into the symmetry and stability of Fekete point config...
متن کاملPolynomial Meshes: Computation and Approximation
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d polynomial least squares and interpolation on compact sets with various geometries. Possible applications range from data fitting to high-order methods for PDEs.
متن کاملA Facility Location Formulation for Stable Polynomials and Elliptic Fekete Points
A breakthrough paper written in 1993 by Shub and Smale unveiled the relationship between stable polynomials and points which minimize the discrete logarithmic energy on the Riemann sphere (a.k.a. elliptic Fekete points). This relationship has inspired advances in the study of both concepts, many of whose main properties are not well known yet. In this paper I prove an equivalent formulation for...
متن کاملThe point counting problem for curves over finite fields
The group law on elliptic curves is well-known and gives rise to elliptic curve cryptography systems which find application to government and industry today. However, the generalisation to higher genus requires the manipulation of divisor classes rather than points, and analogues of key genus 1 results have yet to be found. Nonetheless, effective computation within the group is possible, and te...
متن کامل